-
1 irreducible proof
English-Russian big polytechnic dictionary > irreducible proof
-
2 irreducible proof
foundational proof — основательные, серьёзные доказательства
The English-Russian dictionary general scientific > irreducible proof
-
3 irreducible proof
-
4 irreducible proof
Математика: несводимое доказательство -
5 irreducible proof
-
6 irreducible proof
English-Russian dictionary of computer science and programming > irreducible proof
-
7 irreducible proof
-
8 irreducible proof
Англо-русский словарь по исследованиям и ноу-хау > irreducible proof
-
9 irreducible
1) неприводимый
2) несводимый
3) несократимый
4) нераспадающийся
5) минимальный
– irreducible cross-cut
– irreducible equation
– irreducible error
– irreducible fraction
– irreducible polynomial
– irreducible proof
– medium irreducible -
10 proof
1) доказательство; обоснование; подтверждение2) полигр. корректура, пробный оттиск4) проверка; испытание; проба || проверять; испытывать; опробовать5) безопасный; защищённый6) обеспечивать непроницаемость; герметизировать•proof against — устойчивый к воздействию (какого-л. фактора)
proof by contradiction — мат. доказательство от противного
proof by induction — мат. доказательство по индукции
proof by matrices — мат. доказательство с помощью матриц
proof in outline — набросок [схема] доказательства;
this completes the proof — это завершает доказательство; на этом доказательство заканчивается
- strong proofto give a proof — матем. дать доказательство
-
11 proof
1) доказательство
2) непроницаемый
3) нормативный
4) пробный отпечаток
5) рашкетный
6) стандартный
7) проверка
8) испытание
9) защищенный
10) обоснование
11) безопасный
12) герметизировать
13) проба
– acid proof
– brush proof
– certificate of proof
– existence proof
– first proof
– foundry proof
– galley proof
– indirect proof
– irreducible proof
– not serving as a proof
– page proof
– press proof
– proof against
– proof by contradiction
– proof load
– proof press
– proof scheme
– proof spirit
– proof strength
– proof theory
– rigorous proof
– without proof
-
12 irreducible
1. a не поддающийся упрощению, улучшению2. a мат. несократимый; неприводимый, несводимый3. a минимальный4. a непревратимый5. a мед. невправимый6. a книжн. непреодолимыйСинонимический ряд:after deductions (adj.) after deductions; clear; excluding; exclusive; net; non-deductible; pure; remaining -
13 proof
1) доказательство || доказывать2) проверка3) обеспечивать сопротивляемость (напр., против неумелого использования)•- direct digital color proof
- formal program proof
- formal proof
- indirect proof
- irreducible proof
- page proof
- program proof
- proof of termination
- tree form proof
- variant proof
- zero proofEnglish-Russian dictionary of computer science and programming > proof
-
14 несводимое доказательство
irreducible proofБольшой англо-русский и русско-английский словарь > несводимое доказательство
-
15 scheme
1) схема || составлять схему2) план; замысел || планировать, замышлять•- composite sampling scheme - decisive scheme - double sampling scheme - singly connected scheme -
16 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
17 tree
1) вчт древовидная схема; древовидный дешифратор2) дерево (напр. графа) || древовидный3) крист. дендрит•- tree of given weight
- tree of objectives
- tree of statements
- abstract syntax tree
- adaptive tree
- Adel'son-Vel'ski-Landis tree
- Aronshine tree
- AVL tree
- B-tree
- balanced tree
- bifurcation tree
- binary tree
- binary searchtree
- Boolean tree
- branching tree
- Cartesian tree
- Cayley tree
- choice tree
- classification tree
- classification and regression tree
- clock tree
- cluster tree
- co-tree
- code tree
- command tree
- complement tree
- complete code tree
- computation tree
- conference tree
- countable tree
- decision tree
- decomposition tree
- deduction tree
- derivation tree
- edge-rooted tree
- equipotential tree
- existence trie tree
- fault tree
- Feigenbaum tree
- Fibonacci tree
- finite tree
- fractal tree
- game tree
- generation tree
- graph tree
- hardware tree
- hierarchical tree
- homeomorphically irreducible tree
- Husimi tree
- hypothesis search tree
- inference tree
- information tree
- labeled tree
- language tree
- lexicographic tree
- loaded fractal tree
- logical tree
- minimal tree
- minimal length tree
- multibranch tree
- multiway tree
- normal tree
- optimal tree
- optimal merge tree
- optimal search tree
- ordered tree
- oriented tree
- outcome tree
- parse tree
- parsing tree
- patricia tree
- planar tree
- plane tree
- priority tree
- priority search tree
- probability tree
- production tree
- proper tree
- proof tree
- radix tree
- randomized binary tree
- RB tree
- recursive tree
- red-black tree
- response tree
- rooted tree
- search tree
- selection tree
- shortest tree
- shortest-distance tree
- signed tree
- spanning tree
- specific tree
- subject tree
- subspanning tree
- suffix tree
- symmetric tree
- syntax tree
- ternary tree
- ternary search tree
- threaded tree
- topological tree
- transition tree
- trie tree
- two-color tree
- two-dimensional tree
- two-level tree
- unlabeled tree
- weighted tree -
18 matrix
1) мат. матрица || матричный2) форма, шаблон4) растр5) решётка6) таблица7) геол. материнская порода, основная масса ( породы)8) основа кристаллического вещества; кристаллическая решётка•- absolutely equivalent matrices - adjoint matrices - almost perfect matrix - almost periodic matrix - almost superdiagonal matrix - associative matrix - birth-death coefficient matrix - cocycle matrix - commutative matrix - commute matrices - commuting matrix - complex conjugate matrix - compound matrix - conjunctive matrices - consistently ordered matrix - constituent matrices - deficient matrix - doubly degenerated matrix - doubly stochastic matrix - encoding matrix - essentially positive matrix - magnetic core matrix - matrix of linear transformation - multiplicatively cogredient matrix - multiply degenerate matrix - mutually consistent matrices - nearly triangular matrix - negatively semidefinite matrix - nonnegatively semidefinite matrix - orthogonally similar matrices - positively definite matrix - positively semidefinite matrix - regularly partitioned matrix - strictly upper triangular matrix - strongly equivalent matrices - totally nonnegative matrix - totally positive matrix - totally unimodular matrix - uniformly tapered matrix - vertex incidence matrix - vertically symmetrical matrix - weakly cyclic matrix -
19 tree
1) дерево, древо || засаживать деревьями2) древовидная схема; древовидная структура3) т. граф. дерево4) pl дендритные образования на катоде ( при электроосаждении металлов)- mixed star tree - plane tree- set tree -
20 representation
1. n изображение, образ2. n филос. понятие; представление; образ3. n представление, показ на сцене4. n утверждение, заявление5. n протест6. n представительство7. n мат. физ. представление, запись, выражение; формализмСинонимический ряд:1. depiction (noun) copy; delineation; depiction; description; imitation; portraiture; portrayal; presentment; reproduction2. picture (noun) drawing; illustration; painting; photograph; picture; piece; portrait
См. также в других словарях:
Distributive lattice/Proofs — Lemma 1Every totally ordered set is a distributive lattice with max as join and min as meet.ProofWe will show: : x vee (y wedge z) = (x vee y)wedge(x vee z)We may suppose yle z (If not, zle y and we may switch y and z.) Recall that yle z is… … Wikipedia
Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… … Wikipedia
Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… … Wikipedia
Finite field — In abstract algebra, a finite field or Galois field (so named in honor of Évariste Galois) is a field that contains only finitely many elements. Finite fields are important in number theory, algebraic geometry, Galois theory, cryptography, and… … Wikipedia
Character theory — This article refers to the use of the term character theory in mathematics. For the media studies definition, see Character theory (Media). In mathematics, more specifically in group theory, the character of a group representation is a function… … Wikipedia
Feit–Thompson theorem — In mathematics, the Feit–Thompson theorem, or odd order theorem, states that every finite group of odd order is solvable. It was proved by Walter Feit and John Griggs Thompson (1962, 1963) Contents 1 History 2 Significance of the proof … Wikipedia
Holonomy — Parallel transport on a sphere depends on the path. Transporting from A → N → B → A yields a vector different from the initial vector. This failure to return to the initial vector is measured by the holonomy of the connection. In differential… … Wikipedia
Prime number — Prime redirects here. For other uses, see Prime (disambiguation). A prime number (or a prime) is a natural number greater than 1 that has no positive divisors other than 1 and itself. A natural number greater than 1 that is not a prime number is… … Wikipedia
Intelligent design — This article is about intelligent design as promulgated by the Discovery Institute. For other uses, see Intelligent design (disambiguation). For the philosophical argument from design , see Teleological argument … Wikipedia
Clifford theory — For the result about curves, see Clifford s theorem on special divisors. In mathematics, Clifford theory, introduced by Clifford (1937), describes the relation between representations of a group and those of a normal subgroup. Alfred H. Clifford… … Wikipedia
Geometrization conjecture — Thurston s geometrization conjecture states that compact 3 manifolds can be decomposed canonically into submanifolds that have geometric structures. The geometrization conjecture is an analogue for 3 manifolds of the uniformization theorem for… … Wikipedia